A sharp estimate for cover times on binary trees
نویسندگان
چکیده
We compute the second order correction for the cover time of the binary tree of depth n by (continuous-time) random walk, and show that with probability approaching 1 as n increases, √ τcov = √ |E|[ √ 2 log 2 ·n− logn/ √ 2 log 2+O((log logn)], thus showing that the second order correction differs from the corresponding one for the maximum of the Gaussian free field on the tree.
منابع مشابه
A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملStudy on the effect of forest stand distribution pattern on results of different estimators of the nearest individual distance method
The Nearest Individual Sampling Method is one of the distance sampling methods for estimating density, canopy cover and height of forest stands. Some distance sampling methods have more than one density estimator that may be skewed to the spatial pattern. Unless the stands of the trees under study have a random spatial pattern. Therefore, the purpose of this study was evaluating the effect of s...
متن کاملHydras: Directed Hypergraphs and Horn Formulas
We introduce a new graph parameter, the hydra number, arising from the minimization problem for Horn formulas in propositional logic. The hydra number of a graph G = (V, E) is the minimal number of hyperarcs of the form u, v → w required in a directed hypergraph H = (V, F ), such that for every pair (u, v), the set of vertices reachable in H from {u, v} is the entire vertex set V if (u, v) ∈ E,...
متن کاملProfiles of Random Trees: Correlation and Width of Ran- Dom Recursive Trees and Binary Search Trees
The levels of trees are nodes with the same distance to the root. We derive asymptotic approximations to the correlation coefficients of two level sizes in random recursive trees and binary search trees, which undergo sharp sign-changes when one level is fixed and the other one is varying. We also propose a new means for deriving an asymptotic estimate for the expected width, which is the numbe...
متن کاملA Sharp Maximal Function Estimate for Vector-Valued Multilinear Singular Integral Operator
We establish a sharp maximal function estimate for some vector-valued multilinear singular integral operators. As an application, we obtain the $(L^p, L^q)$-norm inequality for vector-valued multilinear operators.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011